left rotationの例文

例文

もっと例文:   1  2  3

1. Thus left rotation by a single bit has a simple description modulo 3.
2. AVL trees and red-black trees are two examples of binary search trees that use the left rotation.
3. A single left rotation is done in O ( 1 ) time but is often integrated within the node insertion and deletion of binary search trees.
4. The barrel breech is locked through a rotating bolt ( left rotation ) and uses three locking lugs to engage corresponding locking recesses in the barrel extension.
5. Split is a left rotation and level increase to replace a subtree containing two or more consecutive right horizontal links with one containing two fewer consecutive right horizontal links.